Counting certain quadratic partitions of zero modulo a prime number
نویسندگان
چکیده
منابع مشابه
Counting Homomorphisms to Trees Modulo a Prime
Many important graph theoretic notions can be encoded as counting graph homomorphism problems, such as partition functions in statistical physics, in particular independent sets and colourings. In this article we study the complexity of #pHomsToH, the problem of counting graph homomorphisms from an input graph to a graph H modulo a prime number p. Dyer and Greenhill proved a dichotomy stating t...
متن کاملOn the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
Let P be a prime number and al, at be distinct integers modulo P. Let x be chosen at random with uniform distribution in Zp , and let yi = x + ai . We prove that the joint distribution of the quadratic characters of the yi 's deviates from the distribution of independent fair coins by no more than t(3 + xfi-)/P. That is, the probability of (Yi, ...Y, t) matching any particular quadratic charact...
متن کاملCounting Solutions to Discrete Non-Algebraic Equations Modulo Prime Powers
As society becomes more reliant on computers, cryptographic security becomes increasingly important. Current encryption schemes include the ElGamal signature scheme, which depends on the complexity of the discrete logarithm problem. It is thought that the functions that such schemes use have inverses that are computationally intractable. In relation to this, we are interested in counting the so...
متن کاملSet systems with I-intersections modulo a prime number
Let p be a prime and let L = {l1, l2, . . . , ls} and K = {k1, k2, . . . , kr} be two subsets of {0, 1, 2, . . . , p − 1} satisfying max lj < min ki. We will prove the following results: If F = {F1, F2, . . . , Fm} is a family of subsets of [n] = {1, 2, . . . , n} such that |Fi ∩ Fj | (mod p) ∈ L for every pair i 6= j and |Fi| (mod p) ∈ K for every 1 ≤ i ≤ m, then |F| ≤ ( n− 1 s ) + ( n− 1 s− 1...
متن کاملNumber theoretic transform modulo K.2N+1, a prime
Due to its simple and real arithmetic structure Number Theoretic Transform is attractive for computation of convolution. However, there exists a stringent relation between the choice of modulus M and convolution length. Choice of modulus as K.2+1, a prime, leads to relaxation of this constraint and wide choices of wordlength, with each of these associated with many choices of convolution length...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2021
ISSN: 2391-5455
DOI: 10.1515/math-2021-0032